منابع مشابه
Testing of Macroscopic Hardness by Acoustic Response
ČERNÝ MICHAL, ŠUSTR MICHAL, DOSTÁL PETR. 2016. Testing of Macroscopic Hardness by Acoustic Response. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 64(3): 751–758. Static measurement of macroscopic hardness (hereina er macrohardness) of metal materials by using indentation testing is accompanied by deformation in the vicinity of the indenter. Its indenting in a material...
متن کاملLow-Load Vickers Microindentation Hardness Testing
ADVANCED MATERIALS & PROCESSES • APRIL 2012 I n 1925 in the UK, Smith and Sandland developed an indentation test that used a squarebased pyramidal-shaped indenter made of diamond[1]. The test was developed because the Brinell test (introduced in 1900), which (until recently) used a round hardened steel ball indenter, could not test steels harder than ~450 HB (~48 HRC). They chose this shape wit...
متن کاملFlipping out with many flips: hardness of testing k-monotonicity
A function f : {0, 1} → {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in circuit complexity, PAC learning, and cryptography. Our work is part of a renewed focus in understanding testability of properties characterized by freeness of ...
متن کاملNP-hardness of polytope M-matrix testing and related problems
In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizations of M-matrices, our result establishes NP-hardness of several fundamental problems in systems analysis and control, such as testing the instability of an uncertain dynamical system, and minimizing the spectral radi...
متن کاملTaming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MRS Bulletin
سال: 1994
ISSN: 0883-7694,1938-1425
DOI: 10.1557/s0883769400048491